Effective Forwarding Scheme for Opportunistic Networks Based on Refined Contact Probability and Betweenness Centrality
نویسندگان
چکیده
When forwarding in opportunistic networks, the higher contact probability that the destination node has, the more likely it is to forward the message to the destination. Moreover, the higher the betweenness centrality that a node has, the more likely it is to act as a bridge node toward the destination in the network. Each of these two metrics is exploited in existing forwarding schemes. Nevertheless, these schemes suffer from high network traffic and fail to balance network traffic and transmission delay while maintaining a lower hop count. To resolve these problems, we propose a novel forwarding scheme that considers refined contact probability and betweenness centrality. In the proposed scheme, nodes with higher probabilities of contact with other nodes tend to gather together, while nodes with higher betweenness centralities compensate for intermittent connection disruptions among nodes in the network. Experimental results show that the proposed scheme outperforms most known forwarding schemes in balancing network traffic and transmission delay.
منابع مشابه
Opportunistic Forwarding with Partial Centrality
In opportunistic networks, the use of social metrics (e.g., degree, closeness and betweenness centrality) of human mobility network, has recently been shown to be an effective solution to improve the performance of opportunistic forwarding algorithms. Most of the current social-based forwarding schemes exploit some globally defined node centrality, resulting in a bias towards the most popular n...
متن کاملIdentifying Influential Nodes for Efficient Routing in Opportunistic Networks
—Opportunistic networks exploit human mobility and consequent device-to-device contacts to opportunistically create data paths over time. Identifying influential nodes as relay is a crucial problem for efficient routing in opportunistic networks. The degree centrality method is very simple but of little relevance. Although closeness centrality and betweenness centrality can effectively identif...
متن کاملOn Using Probabilistic Forwarding to Improve HEC-Based Data Forwarding in Opportunistic Networks
In this paper, we propose the HEC-PF scheme, an enhancement of our previous H-EC scheme for effective data forwarding in opportunistic networks. The enhanced scheme modifies the aggressive forwarding phase of the H-EC scheme by implementing a new Probabilistic Forwarding feature, which decides whether to forward a message to a newly encountered node based on the delivery probability. Using simu...
متن کاملA Novel Social Context-Aware Data Forwarding Scheme in Mobile Social Networks
Routing in disconnected delay-tolerant mobile ad hoc networks (MANETs) continues to be a challenging issue. Several works have been done to address the routing issues using the social behaviors of each node. Mobile Social Networks (MSNs) are increasingly popular type of Delay Tolerant Networks (DTNs). The routing performance improves when knowledge regarding the expected topology and the social...
متن کاملA Routing Mechanism Based on Social Networks and Betweenness Centrality in Delay-Tolerant Networks
With the growing popularity of mobile smart devices, the existing networks are unable to meet the requirement of many complex scenarios; current network architectures and protocols do not work well with the network with high latency and frequent disconnections. To improve the performance of these networks some scholars opened up a new research field, delay-tolerant networks, in which one of the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Inf. Sci. Eng.
دوره 33 شماره
صفحات -
تاریخ انتشار 2017